Programs for Problems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Undecidable Boundedness Problems for Datalog Programs

A given Datalog program is bounded if its depth of recursion is independent of the input database. Deciding boundedness is a basic task for the analysis of database logic programs. The undecidability of Datalog boundedness was rst demonstrated by Gaifman et al. We introduce new techniques for proving the undecidability of various kinds of boundedness, which allow us to considerably strengthen t...

متن کامل

global results on some nonlinear partial differential equations for direct and inverse problems

در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...

thyroid carcinoma and radiation some difficult problems in screening programs

thus the data show a re lationship between radiation and the development of thyroid ca rci noma and i mp l y that s eeking and r emoving such tumors woul d be beneficial . as in most situations, however, this s i mp l e r elationship is clouded by a va r i e t y of associated prob l ems , which mus t be ca r efull y considered. the surgical pr oce dure r e c ommended f or r emoval o f a nodule ...

متن کامل

Improved dynamic programs for batching problems with maximum lateness criterion

We study a class of scheduling problems involving the maximum lateness criterion and an element of batching For all the problems that we examine algorithms appear in the literature which consist of a sorting step to determine an optimal job sequence followed by a dynamic programming step which determines the optimal batches In each case the dynamic program is based on a backward recursion of wh...

متن کامل

Achilles, Turtle, and Undecidable Boundedness Problems for Small DATALOG Programs

DATALOG is the language of logic programs without function symbols. It is considered to be the paradigmatic database query language. If it is possible to eliminate recursion from a DATALOG program then it is bounded. Since bounded programs can be executed in the parallel constant time, the possibility of automatized boundedness detecting is believed to be an important issue, and has been studie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1969

ISSN: 0028-0836,1476-4687

DOI: 10.1038/2221303b0